Forcing Subsets of Connected Co-Independent Hop Domination in the Join and Corona of Graphs
نویسندگان
چکیده
This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values domination numbers graphs resulting from some binary operations such asjoin and corona are determined.Some main results generated this include characterization sets, for these types bounds join
منابع مشابه
Secure Restrained Domination in the Join and Corona of Graphs
Let G be a connected simple graph. A restrained dominating set S of the vertex set of G, V (G) is a secure restrained dominating set of G if for each u ∈ V (G) \ S, there exists v ∈ S such that uv ∈ E(G) and the set (S \ {v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a secure restrained dominating set of G, denoted by γsr(G), is called the secure restrained dominatio...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملthe analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولTotal Co-Independent Domination in Graphs
A set D of vertices in a graph G is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A dominating set D of a graph G is total dominating set if the induced subgraph 〈D〉 has no isolated vertices. In this paper, we introduce the total co-independent domination in graphs, exact value for some s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2022
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v15i4.4493